Order acceptance using genetic algorithms

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Order acceptance using genetic algorithms

Follow this and additional works at: http://engagedscholarship.csuohio.edu/bus_facpub Part of the Management Information Systems Commons Publisher's Statement NOTICE: this is the author’s version of a work that was accepted for publication in Computers & Operations Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and othe...

متن کامل

Infrastructure Work Order Planning Using Genetic Algorithms

Infrastructure management offices plan and complete several thousand small construction projects annually. Effective planning is vital if the public and private sectors are to maintain valuable infrastructure investments at the least cost to the taxpayer or shareholder. This paper presents the results an application of Genetic Algorithms (GA) in multi-project resource allocation to minimize the...

متن کامل

Components Execution Order Using Genetic Algorithms

The current trend in software engineering is towards componentbased development. A challenge in component-based software development is how to assemble components effectively and efficiently. In this paper we present a new approach for computing components execution order. Using Genetic Algorithms GA we compute the final system from specified components with conditions order. Some numerical exp...

متن کامل

Enhancing Branch-and-Bound Algorithms for Order Acceptance and Scheduling with Genetic Programming

Enhancing Branch-and-Bound Algorithms for Order Acceptance and Scheduling with Genetic Programming Su Nguyen, Mengjie Zhang, Mark Johnston Order acceptance and scheduling (OAS) is an important planning activity in make-to-order manufacturing systems. Making good acceptance and scheduling decisions allows the systems to utilise their manufacturing resources better and achieve higher total profit...

متن کامل

Learning First-order Relations from Noisy Databases using Genetic Algorithms

In knowledge discovery from databases, we emphasize the need for learning from huge, incomplete and imperfect data sets (Piatetsky-Shapiro and Frawley, 1991). To handle noise in the problem domain, existing learning systems avoid overfitting the imperfect training examples by excluding insignificant patterns. The problem is that these systems use a limiting attribute-value language for represen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Operations Research

سال: 2009

ISSN: 0305-0548

DOI: 10.1016/j.cor.2008.04.010